32B - Borze - CodeForces Solution


expression parsing implementation *800

Please click on ads to support us..

Python Code:

a = list(input())
c = []
while len(a) > 0:

    if a[0] == '-' and a[1] == '.':
        c.append("1")
        del a[0:2]

    elif a[0] == "-" and a[1] == "-":
        c.append("2")
        del  a[0:2]
    else:
        c.append("0")
        del a[0]

print("".join(c))

C++ Code:

#include<iostream>
#include<string>
using namespace std;
 
int main(){
 string  s;
 cin>>s;
 
 for (int i = 0;i<s.length();i++){
 	if(s[i]=='.'){
 		cout<<"0";
	 }
	 
	   else if (s[i]=='-'){
	     if( s[i+1]== '.' ){
	 	cout<<"1";
	 }
	  else if (s[i+1]=='-' ){
	 	cout<<"2";
	 }
	 i++;
}
 
	 
 }
 
  return 0;
}


Comments

Submit
0 Comments
More Questions

922A - Cloning Toys
817A - Treasure Hunt
1136B - Nastya Is Playing Computer Games
1388A - Captain Flint and Crew Recruitment
592B - The Monster and the Squirrel
1081A - Definite Game
721C - Journey
1400A - String Similarity
1734E - Rectangular Congruence
1312D - Count the Arrays
424C - Magic Formulas
1730C - Minimum Notation
1730B - Meeting on the Line
1730A - Planets
302B - Eugeny and Play List
1730D - Prefixes and Suffixes
1515C - Phoenix and Towers
998A - Balloons
1734F - Zeros and Ones
1144B - Parity Alternated Deletions
92B - Binary Number
1144C - Two Shuffled Sequences
1154B - Make Them Equal
1272B - Snow Walking Robot
522B - Photo to Remember
608B - Hamming Distance Sum
1408F - Two Different
274B - Zero Tree
1726H - Mainak and the Bleeding Polygon
722A - Broken Clock